String and Graph Reduction Systems for Gene Assembly in Ciliates
نویسندگان
چکیده
Ciliates have developed a unique nuclear dualism two nuclei of di erent functionality the germline micronucleus and the somatic macronucleus The way that ciliates assemble the macronuclear genes after cell mating constitutes one of the most intricate DNA processings in living organisms This processing is also very interesting from the computational point of view In this paper we investigate the operations of loop excision and hairpin excision reinsertion used in the assembly process In particular we consider three levels of formalization of this process culminating in graph reduction systems
منابع مشابه
Extending the Overlap Graph for Gene Assembly in Ciliates
Gene assembly is an intricate biological process that has been studied formally and modeled through string and graph rewriting systems. Recently, a restriction of the general (intramolecular) model, called simple gene assembly, has been introduced. This restriction has subsequently been defined as a string rewriting system. We show that by extending the notion of overlap graph it is possible to...
متن کاملHow Overlap Determines Reduction Graphs for Gene Assembly
Ciliates are unicellular organisms having two types of functionally different nuclei: micronucleus and macronucleus. Gene assembly transforms a micronucleus into a macronucleus, thereby transforming each gene from its micronuclear form to its macronuclear form. Within a formal intramolecular model of gene assembly based on strings, the notion of reduction graph represents the macronuclear form ...
متن کاملHow Overlap Determines the Macronuclear Genes in Ciliates
Formal models for gene assembly in ciliates have been developed, in particular the string pointer reduction system (SPRS) and the graph pointer reduction system (GPRS). The reduction graph is a valuable tool within the SPRS, revealing much information about how gene assembly is performed for a given gene. The GPRS is more abstract than the SPRS and not all information present in the SPRS is ret...
متن کاملComputing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The gene assembly, based on three types of operations only, is then modeled as a graph reduction process (to the empty graph). Motivated by the robustness of the gene assembly process, the notions of parallel reduction and p...
متن کاملComputational Processes in Living Cells: Gene Assembly in Ciliates
One of the most complex DNA processing in nature known to us is carried out by ciliates during the sexual reproduction when their micronuclear genome is transformed to the macronuclear genome. This process of gene assembly is intriguing and captivating also from the computational point of view. We investigate here three intramolecular molecular operations (ld, hi, and dlad) postulated to accomp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 12 شماره
صفحات -
تاریخ انتشار 2002